On the Complexity of Monotonic Inheritance with Roles
نویسندگان
چکیده
We investigate the complexity of reasoning with monotonic inheritance hierarchies that contain, beside ISA edges, also ROLE (or FUNCTION) edges. A ROLE edge is an edge labelled with a name such as spouse-of or brother-of. We call such networks ISAR networks. Given a network with n vertices and m edges, we consider two problems: (P,) determining whether the network implies an isa relation between two particular nodes, and (P,) determining all isa relations implied by the network. As is well known, without ROLE edges the time complexity of P, is O(m), and the time complexity of P, is O(n3). Unfortunately, the results do not extend naturally to ISAR networks, except in a very restricted case. For general ISAR network we frost give an polynomial algorithm by an easy reduction to proposional Horn theory. As the degree of the polynomial is quite high (O(mn4) for P,, O(mn’) for P,), we then develop a more direct algorithm. For both P, and P, its complexity is O(n3 + m*). Actually, a finer analysis of the algorithm reveals a complexity of O(nr(Zog r) + n*r + n3), where r is the number of different ROLE labels. One corolary is that if we fix the number of ROLE labels, the complexity of our algorithm drops back to O(n3).
منابع مشابه
برآورد وراثتپذیری و ژنهای کنترلکننده عملکرد دانه و برخی صفات مرتبط با آن در تلاقی ارقام افضل با رادیکال جو
In order to estimate the number and inheritance of controlling genes for grain yield and some of the related traits in barley, Afzal and Radical varieties along with their F1, F2 and F3 generations were planted in a randomized complete block design with three replications. Head weight, head length, number of heads, number of spikelets, awn length, hundred grain weight, grains per head, straw yi...
متن کاملOn the Non-Monotonic Description Logic $\mathcal{ALC}$+T$_{\mathsf{min}}$
In the last 20 years many proposals have been made to incorporate non-monotonic reasoning into description logics, ranging from approaches based on default logic and circumscription to those based on preferential semantics. In particular, the non-monotonic description logic ALC+Tmin uses a combination of the preferential semantics with minimization of a certain kind of concepts, which represent...
متن کاملDescription Logics with Circumscription
We show that circumscription can be used to extend description logics (DLs) with non-monotonic features in a straightforward and transparent way. In particular, we consider extensions with circumscription of the expressive DLsALCIO and ALCQO and prove that reasoning in these logics is decidable under a simple restriction: only concept names can be circumscribed, and role names vary freely durin...
متن کاملبرآورد وراثتپذیری و ژنهای کنترلکننده عملکرد دانه و برخی صفات مرتبط با آن در تلاقی ارقام افضل با رادیکال جو
In order to estimate the number and inheritance of controlling genes for grain yield and some of the related traits in barley, Afzal and Radical varieties along with their F1, F2 and F3 generations were planted in a randomized complete block design with three replications. Head weight, head length, number of heads, number of spikelets, awn length, hundred grain weight, grains per head, straw yi...
متن کاملبررسی آزمایشگاهی و عددی حساسیت باربری محوری فشاری اعضای لولهای فولادی به ناراستیهای هندسی
In practice, steel tubulars lack a mathematically perfect cylindrical shape, due to non-uniformities introduced during the manufacturing process, construction methods, damages incurred in the transport. The imperfections might exist in the cross section and along the tubular member. Imperfections can greatly affect the behavior of tubular members. The work presented in this paper is perusing ef...
متن کامل